-
1 straightforward
adjective1) (frank) freimütig; geradlinig [Politik]; schlicht [Stil, Sprache, Erzählung, Bericht]; klar [Anweisung, Vorstellungen]2) (simple) einfach; eindeutig [Lage]* * *1) (without difficulties or complications; simple: a straightforward task.) einfach* * *straight·for·ward[streɪtˈfɔ:wəd, AM -ˈfɔ:rwɚd]3. (easy) einfach, leichtit's quite \straightforward es ist ganz einfacha \straightforward choice eine leichte Wahl\straightforward process unkomplizierter Vorgang\straightforward question verständliche Frage* * *A adj (adv straightforwardly)1. geradeaus gerichtet2. freimütig, direkt, offen3. ehrlich, aufrichtig4. einfach, unkompliziertB adv1. geradeaus2. → A* * *adjective1) (frank) freimütig; geradlinig [Politik]; schlicht [Stil, Sprache, Erzählung, Bericht]; klar [Anweisung, Vorstellungen]2) (simple) einfach; eindeutig [Lage]* * *adj.ehrlich adj.eindeutig adj.
См. также в других словарях:
approach — {{Roman}}I.{{/Roman}} noun 1 way of dealing with sb/sth ADJECTIVE ▪ conventional, orthodox, traditional ▪ alternate (AmE), alternative, different, fresh, new … Collocations dictionary
Halting problem — In computability theory, the halting problem can be stated as follows: Given a description of a computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a… … Wikipedia
Dominance-based Rough Set Approach — (DRSA) is an extension of rough set theory for Multi Criteria Decision Analysis (MCDA), introduced by Greco, Matarazzo and Słowiński Greco, S., Matarazzo, B., Słowiński, R.: Rough sets theory for multicriteria decision analysis. European Journal… … Wikipedia
Dominance-based rough set approach — (DRSA) is an extension of rough set theory for multi criteria decision analysis (MCDA), introduced by Greco, Matarazzo and Słowiński. [1][2][3] The main change comparing to the classical rough sets is the substitution of the indiscernibility… … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
Principal-agent problem — In political science and economics, the principal agent problem or agency dilemma treats the difficulties that arise under conditions of incomplete and asymmetric information when a principal hires an agent. Various mechanisms may be used to try… … Wikipedia
Circle-ellipse problem — The circle ellipse problem in software development (sometimes known as the square rectangle problem) illustrates a number of pitfalls which can arise when using subtype polymorphism in object modelling. The issues are most commonly encountered… … Wikipedia
Minimum-cost flow problem — The minimum cost flow problem is finding the cheapest possible way of sending a certain amount of flow through a flow network. Contents 1 Definition 2 Relation to other problems 3 Solutions 4 See also … Wikipedia
Moving magnet and conductor problem — Conductor moving in a magnetic field. The moving magnet and conductor problem is a famous thought experiment, originating in the 19th century, concerning the intersection of classical electromagnetism and special relativity. In it, the current in … Wikipedia
Cross-platform — For a type of interchange between different lines in a metro system, see cross platform interchange. In computing, cross platform, or multi platform, is an attribute conferred to computer software or computing methods and concepts that are… … Wikipedia
Wikipedia:Featured article candidates — Here, we determine which articles are to be featured articles (FAs). FAs exemplify Wikipedia s very best work and satisfy the FA criteria. All editors are welcome to review nominations; please see the review FAQ. Before nominating an article,… … Wikipedia
